Solving quadratic programming problem with linear constraints containing absolute values
نویسندگان
چکیده
منابع مشابه
A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملLinear Quadratic Gaussian Problem with Constraints
In this paper, an aggregate production-planning problem is formulated as a stochastic linear quadratic problem with chance constraints on state and control variables. The stochastic model proposed extends the classical aggregate model developed by Holt, Modigliani, Muth and Simon (HMMS). As an example of application, an equivalent deterministic problem is developed from the stochastic model. Th...
متن کاملFully fuzzy linear programming with inequality constraints
Fuzzy linear programming problem occur in many elds such as mathematical modeling, Control theory and Management sciences, etc. In this paper we focus on a kind of Linear Programming with fuzzy numbers and variables namely Fully Fuzzy Linear Programming (FFLP) problem, in which the constraints are in inequality forms. Then a new method is proposed to ne the fuzzy solution for solving (FFLP). Nu...
متن کاملSolving Linear Programming with Constraints Unknown
What is the value of input information in solving linear programming? The celebrated ellipsoid algorithm tells us that the full information of input constraints is not necessary; the algorithm works as long as there exists an oracle that, on a proposed candidate solution, returns a violation in the form of a separating hyperplane. Can linear programming still be efficiently solved if the return...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Electrotechnica et Informatica
سال: 2012
ISSN: 1338-3957,1335-8243
DOI: 10.2478/v10198-012-0024-4